Computing tomographic resolution matrices using Arnoldi’s iterative inversion algorithm
نویسنده
چکیده
Resolution matrices are useful in seismic tomography because they allow us to evaluate the information content of reconstructed images. Techniques based on the multiplicity of equivalent exact formulas that may be used to define the resolution matrices have been used previously by the author to design algorithms that avoid the need for any singular value decomposition of the ray-path matrix. An explicit procedure is presented for computing both model and data resolution matrices using Arnoldi’s algorithm for iterative inversion in seismic tomography. Arnoldi’s method differs from the Lanczos scheme by including explicit reorthogonalization of basis vectors. Some convenient notation is introduced to permit ready comparison of Arnoldi’s method with the Lanczos approach. Arnoldi’s method requires greater storage of basis vectors but completely overcomes the lack of basis vector orthogonality, which is the major practical limitation of the Lanczos method.
منابع مشابه
Tomographic resolution without singular value decomposition
An explicit procedure is presented for computing both model and data resolution matrices within a Paige-Saunders LSQR algorithm for iterative inversion in seismic tomography. These methods are designed to avoid the need for an additional singular value decomposition of the ray-path matrix. The techniques discussed are completely general since they are based on the multiplicity of equivalent exa...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملAn Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems
where T (λ) ∈ R is a family of symmetric matrices depending on a parameter λ ∈ J , and J ⊂ R is an open interval which may be unbounded. As in the linear case T (λ) = λI −A a parameter λ is called an eigenvalue of T (·) if problem (1) has a nontrivial solution x 6= 0 which is called a corresponding eigenvector. We assume that the matrices T (λ) are large and sparse. For sparse linear eigenvalue...
متن کاملDistributed computation of linear inverse problems with application to computed tomography reconstruction
The inversion of linear systems is a fundamental step in many inverse problems. Computational challenges exist when trying to invert very larger linear systems, where limited computing resources mean that only part of the system can be kept in computer memory at any one time. We are here motivated by tomographic inversion problems which often lead to linear inverse problems where millions if no...
متن کاملDistributed Computation of Linear Inverse Problems with Application to Computed Tomography
The inversion of linear systems is a fundamental step in many inverse problems. Computational challenges exist when trying to invert large linear systems, where limited computing resources mean that only part of the system can be kept in computer memory at any one time. We are here motivated by tomographic inversion problems that often lead to linear inverse problems. In state of the art x-ray ...
متن کامل